A weighted bivariate blending rational interpolation based on function values
نویسندگان
چکیده
This paper presents a new weighted bivariate blending rational spline interpolation based on function values. This spline interpolation has the following advantages: firstly, it can modify the shape of the interpolating surface by changing the parameters under the condition that the values of the interpolating nodes are fixed; secondly, the interpolating function is C-continuous for any positive parameters; thirdly, the interpolating function has a simple and explicit mathematical representation; fourthly, the interpolating function only depends on the values of the function being interpolated, so the computation is simple. In addition, this paper discusses some properties of the interpolating function, such as the bases of the interpolating function, the matrix representation, the bounded property, the error between the interpolating function and the function being interpolated. 2010 Elsevier Inc. All rights reserved.
منابع مشابه
Surface Constraint of a Rational Interpolation and the Application in Medical Image Processing
Abstract : A new weighted bivariate blending rational spline with parameters is constructed based on function values of a function only. The interpolation is C1 in the whole interpolating region under the condition which free parameters is not limited. This study deals with the bounded property of the interpolation. In order to meet the needs of practical design, an interpolation technique is e...
متن کاملInformation Matrix Algorithm of Block Based Bivariate Newton-Like Blending Rational Interpolation
Interpolation has wide application in signal processing, numerical integration, Computer Aided Geometric Design (CAGD), engineering technology and electrochemistry. Block based bivariate Newton-like blending rational interpolation can also be calculated based on information matrix algorithm in addition to block divided differences. The paper studied interpolation theorem, dual interpolation of ...
متن کاملApproximate Fekete Points for Weighted Polynomial Interpolation
We compute approximate Fekete points for weighted polynomial interpolation by a recent algorithm based on QR factorizations of Vandermonde matrices. We consider in particular the case of univariate and bivariate functions with prescribed poles or other singularities, which are absorbed in the basis by a weight function. Moreover, we apply the method to the construction of real and complex weigh...
متن کاملFast Algorithms for Periodic Spline Wavelets on Sparse Grids
We consider Boolean sums of univariate interpolation operators which define multivariate jth order blending interpolation operators on sparse grids. Sample spaces are defined as range of the blending operators. Sample and wavelet spaces have significantly lower dimension and good approximation order for certain function spaces. Fast decomposition and reconstruction algorithms for bivariate spli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 217 شماره
صفحات -
تاریخ انتشار 2011